Towards an Efficient Tableau Proof Procedure for Multiple-Valued Logics
نویسنده
چکیده
One of the obstacles against the use of tableau-based theorem provers for non-standard logics is the ineeciency of tableau systems in practical applications, though they are highly intuitive and extremely exible from a proof theoretical point of view. We present a method for increasing the eeciency of tableau systems in the case of multiple-valued logics by introducing a generalized notion of signed formulas and give sound and complete tableau systems for arbitrary propositional nite-valued logics.
منابع مشابه
Bivalent semantics, generalized compositionality and analytic classic-like tableaux for finite-valued logics
The paper is a contribution both to the theoretical foundations and to the actual construction of efficient automatizable proof procedures for non-classical logics. We focus here on the case of finite-valued logics, and exhibit: (i) a mechanism for producing a classic-like description of them in terms of an effective variety of bivalent semantics; (ii) a mechanism for extracting, from the bival...
متن کاملTableau-based Decision Procedures for Hybrid Logic
Hybrid logics are a principled generalization of both modal logics and description logics. It is well-known that various hybrid logics without binders are decidable, but decision procedures are usually not based on tableau systems, a kind of formal proof procedure that lends itself towards computer implementation. In this paper we give four different tableaubased decision procedures for a very ...
متن کاملDyadic semantics for many-valued logics
This paper obtains an effective method which assigns two-valued semantics to every finite-valued truth-functional logic (in the direction of the so-called “Suszko’s Thesis”), provided that its truth-values can be individualized by means of its linguistic resources. Such two-valued semantics permit us to obtain new tableau proof systems for a wide class of finitevalued logics, including the main...
متن کاملTowards Fully Automated Axiom Extraction for Finite-Valued Logics
We implement an algorithm for extracting appropriate collections of classiclike sound and complete tableau rules for a large class of finite-valued logics. Its output consists of Isabelle theories.
متن کاملConstraint Tableaux for Hybrid Logics Draft
Hybrid logics are modal logics with names for worlds. Tableau systems for various hybrid logics were proposed in [6, 7, 20]. We present an improved tableau system for hybrid logic that handles equality for nominals by substitution and generation of inequality constraints. This compiles out the equalities while storing the inequalities, thus allowing for efficient equality reasoning. The proof p...
متن کامل